Generating a session key for authentication and secure data transfer

ABSTRACT

A device for generating a session key which is known to a first communication partner and a second communication partner, for the first communication partner, from secret information which may be determined by the first and second communication partners, includes a first module operable to calculate the session key using a concatenation of at least a part of a random number and a part of the secret information. The device also includes a second module operable to use the session key for communication with the second communication partner.

PRIORITY CLAIM

This application claims priority from German Patent Application No. 102009024604.5, which was filed on Jun. 10, 2009, and from U.S. Provisional Application No. 61/219,930, which was filed on Jun. 24, 2009, which are both incorporated herein by reference in their entirety.

BACKGROUND OF THE INVENTION

Embodiments of the present invention relate to generating a session key as may exemplarily be used for secure mutual authentication between two communication partners and subsequent data transfer.

Secure mutual authentication between two communication partners, such as, for example, two user terminals in the form of a reader and a contact-free data card, in a symmetrical cryptographic method may, for example, be performed using a so-called challenge-response method, like, for example, a two-way or three-way challenge-response method. A challenge-response method is a method for authenticating a communication partner on the basis of knowledge. One communication partner poses a challenge which the other one has to solve (response) so as to prove knowing certain information. Methods of this kind are generally susceptible to side-channel attacks, such as, for example, DPA (differential power analysis), EMA (electro-magnetic analysis), etc. This means that an attacker is principally able to reconstruct a secret key of one of the two terminals and thus principally clone this terminal entailing relatively little effort, for example by recording current profiles (EM radiation profiles) in repeated authentication trials between the communication partners.

Hardware measures for protecting encryption on which authentication is based, such as, for example, block encryption, are relatively expensive.

SUMMARY

According to an embodiment, a device for generating a session key which is known to a first communication partner and a second communication partner, for the first communication partner, from secret information which may be determined by the first and second communication partners, includes a first module operable to calculate the session key using a concatenation of at least a part of a random number and a part of the secret information. The device also includes a second module operable to use the session key for communication with the second communication partner.

According to another embodiment, a method for generating a session key which is known to a first communication partner and a second communication partner, for the first communication partner, from secret information which may be determined by the first and second communication partners, includes acquiring a random number, calculating the session key using a concatenation of at least a part of the random number and a part of the secret information and using the session key for communication with the second communication partner.

Another embodiment may have a computer program product for performing the above method when the computer program product runs on a computer or microcontroller.

Embodiments of the present invention are based on using a protocol-based method which allows using an encryption implementation that is not protected against side-channel attacks and thus cheaper. Embodiments allow deriving a so-called “session key” which is secure against side-channel attacks. This means that a session-specific one-time key (session key) can be derived from an individual “root key” of one of the terminals in order to authenticate and secure subsequent data transfer between two communication partners. Thus, deriving the session key is based on making use of random numbers which in accordance with embodiments may be exchanged between the two communication partners. Providing the random numbers by a third party, a so-called trusted third party, is also conceivable.

Those skilled in the art will recognize additional features and advantages upon reading the following detailed description, and upon viewing the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which:

FIG. 1 shows a schematic illustration of a cryptographic protocol in accordance with an embodiment of the present invention;

FIG. 2A shows a block diagram of a device for generating a session key in accordance with an embodiment of the present invention;

FIG. 2B shows a block diagram of a device for generating a session key in accordance with another embodiment of the present invention;

FIG. 2C shows a block diagram of a device of a session key in accordance with still another embodiment of the present invention;

FIG. 3 shows a flowchart of a method for generating a session key in accordance with an embodiment of the present invention;

FIG. 4 shows an illustration of a flow of an authentication protocol in accordance with an embodiment of the present invention;

FIG. 5 a shows a detailed illustration of generating a session key and mutual authentication in accordance with a first embodiment of the present invention;

FIG. 5 b shows a detailed illustration of generating a session key and mutual authentication in accordance with another embodiment of the present invention;

FIG. 6 shows an overview of a data exchange protocol in accordance with an embodiment of the present invention;

FIG. 7 shows an illustration of calculating a key, derived from the session key, for data transfer between the two communication partners in accordance with an embodiment of the present invention;

FIG. 8 shows a schematic illustration of a data frame to be transmitted;

FIG. 9 shows a schematic illustration of generating a check part for authenticating a message in accordance with an embodiment of the present invention;

FIG. 10 shows a schematic illustration of generating successive check parts for authenticating successive messages in accordance with an embodiment of the present invention;

FIG. 11 shows a schematic illustration of an encrypted data frame;

FIG. 12 shows a schematic illustration of encrypting a data frame to be transmitted in accordance with an embodiment of the present invention;

FIG. 13 shows a schematic illustration of encrypting data frames to be transmitted successively in accordance with an embodiment of the present invention;

FIG. 14 shows a schematic illustration of decrypting a data frame received in accordance with an embodiment of the present invention;

FIG. 15A shows a schematic illustration of an autonomous non-linear feedback shift register in accordance with an embodiment of the present invention; and

FIG. 15B shows a schematic illustration of a non-linear feedback shift register including coupling-in in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

An advantage of embodiments of the present invention is that an improved concept against side-channel attacks compared to conventional protective measures is provided.

Embodiments of the present invention allow secure mutual authentication of two communication partners which will subsequently be referred to, without limiting generality, as terminal or reader T and contact-free chip card P (proximity integrated circuit card, PICC). Generally, different configurations of the two communication partners, such as, for example, server-client configurations, are of course also conceivable. Proximity cards are generally used in close proximity of a reader, for example for paying purposes. A passive chip card, in particular a passive RFID (radio frequency identification) chip card which receives its energy from the reader, may be used. Proximity cards of this kind may exemplarily operate at frequencies of 125 kHz or 13.56 MHz.

In addition, embodiments of the present invention allow integrity protection of messages exchanged between the two communication partners T and P after authentication. Protection of the exchanged messages themselves, i.e. privacy protection, is also possible. Thus, the communication partners may, after mutual authentication in accordance with an embodiment, agree to either a data transfer mode including integrity protection or a data transfer mode including privacy protection. A prerequisite here is that common secret information may be determined by both the first and the second communication partners, similar to the so-called private key cryptography.

FIG. 1 shows a schematic illustration of a cryptographic part of a communication protocol in accordance with an embodiment of the present invention. The cryptographic part of the protocol consists of two parts: authentication 10 and subsequent data transfer 12.

During authentication 10, the two communication partners P and T authenticate each other. In accordance with embodiments, this may take place using a three-way challenge-response protocol. The result of authentication 10 is either acceptance or rejection of the respective other communication partner. In the case of acceptance, a common temporary secret, a so-called session key k₀, and maybe additional information needed for subsequent data transfer 12, result from the authentication 10 of a common temporary secret.

After successful authentication 10, the first communication partner P may release parts of its memory for access by the second communication partner T. Thus, the second communication partner T is able to read and/or write certain data blocks for which it is in possession of corresponding access rights. Thus, P can read/write from/to P's non-volatile memory (NVM). The commands for this may originate from the second communication partner T. This applies in particular for embodiments in which the first communication partner P is a contact-free chip card and the second communication partner T is a reader.

In accordance with embodiments, there are two measures for securing data transfer 12: A data integrity protection mechanism, called MAC (message authentication code) mode; and a privacy protection mechanism, called encryption mode.

In accordance with embodiments, only one of the protection modes can be used at a certain time for data transfer 12 between the two communication partners P and T. The protection of the data transfer 12 is bound to the authentication 10 by the session key k₀ determined during previous authentication.

For integrity protection, the session key k₀ is, in accordance with embodiments, used as a basic key to generate so-called message authentication codes (MACs), i.e. check parts for authenticating a message sent.

For privacy protection, the session key k₀ is used as a basic key for encrypting data packages transmitted.

After having shown an overview of the inventive concept using FIG. 1, embodiments of the present invention are to be described in greater detail using the other figures.

FIG. 2A is a schematic illustration of a device 20 for generating a session key k₀ which is known to a first communication partner and a second communication partner, for the first communication partner. Thus, the session key k₀ is generated from secret information k_(IV) which may be determined by the first and second communication partners. Here, the device 20 is associated to the first communication partner. Which of the two communication partners P and T looked at here is referred to as the first and the second communication partners is irrelevant.

The device 20 includes means 22 for obtaining a random number r. At least a part r_(P) or r_(T) of the random number r may be fed to means 24 for calculating the session key k₀ using a concatenation of the at least one part of the random number and a part of the secret information k_(IV). Means 26 is provided for obtaining the secret information k_(IV). The session key k₀ calculated may then be used by means 28 for communicating with the second communication partner (not shown). An interface 29 having an input 29 a and an output 29 b is provided for communication with the second communication partner.

Depending on which communication partner the device 20 for generating the session key k₀ is used in, different requirements may result for the individual blocks or means of the device 20. When the device 20 is exemplarily used in a proximity card P, in accordance with embodiments, different resources are provided so as to ensure secure authentication and secure data transfer between P and T. A block diagram of a device 20 integrated in a proximity card P is shown in FIG. 2B.

The means 26 for obtaining the secret information k_(IV) is, in accordance with this embodiment, configured to provide a chip-individual identification IV of the first communication partner, i.e. exemplarily of the proximity card P, and to derive the secret information k_(IV) therefrom. This may take place in a manufacturer-specific manner.

The means 22 for obtaining the random number, in accordance with embodiments, includes a cryptographic random number generator RNG as a hardware module. At least a part r_(P) of the random number r can be generated by same.

In accordance with an embodiment, the means 24 for calculating the session key k₀ includes a hardware module for encryption and/or decryption. This may be block encryption, in particular block encryption in accordance with the AES (Advanced Encryption Standard). The concatenation of at least a part r_(P) of the random number and the part of the secret information k_(IV) may be performed, on the part of a contact-free chip card P, by a hardware module NLM. The concatenation in accordance with an embodiment is a non-linear concatenation or map (NLM).

Generally, it may be assumed that a reader T is located in surroundings protected against attacks. Thus, less security-relevant requirements are to be imposed on the hardware implementation of a reader. Considering the schematic setup, a device 20 for generating the session key k₀ integrated on the part of a reader T does not differ from a device 20 for generating the session key k₀ included on the part of a chip card P. In accordance with embodiments, the secret information k_(IV) is only obtained on the part of the reader T in a different manner, which is why there may be fundamental differences between the communication partners with regard to the means 26. This is shown in FIG. 2C.

On the part of a reader T, the means for obtaining the secret information k_(IV) may be configured to obtain the secret information k_(IV) based on an apparatus-specific identification IV of the chip card P and a general key k_(M). Thus, the general key k_(M) and the apparatus-specific identification IV may be fed to a key-extracting function KD in order to determine k_(IV).

Before discussing an embodiment of an inventive method for generating a session key in greater detail, a rough overview of the method steps will be given making reference to FIG. 3.

The individual method steps here may be performed by each one of the two communication partners. The method steps, however, may also be distributed differently to the two communication partners. Finally, it is also conceivable for a third trusted identity to perform the method steps.

In a first step 32, a random number r or a part thereof is obtained. In a second step 34, the session key k₀ is calculated using a concatenation of at least a part of the random number and a part of the secret information k_(IV). Subsequently, in a third step 36, the calculated session key k₀ is used for communication between the two communication partners P and T.

The following mathematical notation is used for the detailed description which follows:

Mathematical equality of two expressions x and y is expressed by: x=y,  (1) wherein an assignment of a value x to a variable y is written as: y:=x.  (2)

A concatenation z of two binary numbers x and y is: z:=x∥y.  (3)

An addition modulo 2 or a bit-wise exclusive-OR of two binary numbers x and y is written as: z:=x XOR y  (4)

An encryption of a 2^(x)-bit data block m using a 2^(y)-bit key k is expressed as follows: c:=AES(key=k,m)  (5) wherein embodiments of the present invention provide for block encryption, in particular an encryption in accordance with the AES standard. Correspondingly, a decryption is denoted by: m:=AES⁻¹(key=k,c)  (6) wherein this may be block decryption in accordance with the AES standard.

A flowchart for generating the session key k₀ and mutual authentication of the two communication partners P and T in accordance with an embodiment of the present invention is shown in the flow/sequence chart of FIG. 4.

Subsequently, detailed explanations will be given regarding every step taken on the part of the first communication partner P and the second communication partner T, taking an order of execution of the individual steps into consideration. For the embodiment illustrated in FIG. 4, the described order of the individual steps is important. The steps here are referred to by P0, P1, . . . , n and T0, T1, . . . Tn, respectively, P indicating the first communication partner, T indicating the second communication partner and the indices n referring to the temporal order. Steps which may be executed simultaneously or which may be exchanged so as to make implementation easier will be highlighted explicitly. For the sake of a simplified illustration, every step will be given a name.

P1: Generating a Random Number on the Part of the First Communication Partner P:

The on-chip random generator RNG can be started to generate two random numbers r_(P) and R_(P) in accordance with one embodiment. R_(P) may have a width of 128 bits in accordance with embodiments and be sent to the second communication partner T as a so-called “challenge”. In accordance with one embodiment, r_(P) has a width of 32 bits and may be used for calculating the session key k₀. R_(P) and r_(P) are assumed to be binary numbers including independently and uniformly distributed random bits. In accordance with one embodiment, the means 22 for obtaining the random number is adapted to determine at least a first part of the random number in a random or pseudo-random manner.

P2: First Message from the First Communication Partner P to the Second Communication Partner T:

In accordance with embodiments, the first communication partner P concatenates its apparatus identification IV, the P-side session key random value r_(P) and the P-side random challenge R_(P) to form a first message M₁ which is transferred to the second communication partner T: M ₁ :=IV∥r _(P) ∥R _(P).  (11)

This means that, after receiving the random numbers r_(P) and R_(P), r_(P) is transferred to the second communication partner T together with R_(P) and the apparatus-specific identification IV.

P3: Determining the Secret Information k_(IV) on the Part of the First Communication Partner P:

The secret information k_(IV) may be obtained on the part of P by manufacturer-specific measures which protect the secret information k_(IV) from attacks.

T4: Generating a Random Number on the Part of the Second Communication Partner T:

The means 22 for obtaining the random number or the random number generator RNG on the part of the second communication partner T may be started so as to obtain two random numbers r_(T) and R_(T). Thus, R_(T) may in accordance with embodiments have a width of 128 bits and serve as a “challenge” which is transmitted to the first communication partner P. r_(T) may in accordance with embodiments have a width of 32 bits and be used for calculating the session key k₀. R_(T) and r_(T) both include independently and uniformly distributed random bits.

T5: Determining the Secret Information k_(IV) on the Part of the Second Communication Partner T:

After receiving the first message M₁ of the first communication partner P (step P2), the second communication partner T may derive the secret information, i.e. the individual secret key k_(IV) of the first communication partner, for example from a general key k_(M) together with the apparatus-specific identification IV obtained by means of a key derivation function KD: k _(IV) :=KD(k _(M) ,IV).  (14)

A definition of the key derivation function KD may be manufacturer-specific and thus have no influence on the inventive protocol. On the part of the reader T, the secret information k_(IV) may thus be determined by means of a key derivation function KD based on a general key k_(M) and a transferred apparatus-specific identification IV of the chip card P.

T6: Calculating the Session key k₀ on the Part of the Second Communication Partner T:

The session key k₀ is calculated using a concatenation SK of at least a part of the random number and a part of the secret information k_(IV). Thus, x=(x₀,x₁, . . . , x₁₂₇) ε GF(2)¹²⁸ and y=(y₀,x₁, . . . , y₃₁) ε GF(2)³², GF(2)^(n) denoting a Galois body, i.e. a quantity having a finite number of 2^(n) elements on which the basic operations of addition, subtraction, multiplication and division are defined. Thus, the following function EXT:GF(2)¹²⁸ →GF(2)³²  (15) generally means an extraction of any 32 bits of a 128-bit value. In accordance with embodiments, the 32 least significant bits are extracted. The following function PAD:GF(2)³² →GF(2)¹²⁸  (16) however refers to generally any padding of a 32-bit value to form a 128-bit value. This means that PAD refers to a bit padding rule. In accordance with embodiments, a 32-bit value is padded by zeros to form a 128-bit value.

In accordance with one embodiment, the second communication partner T calculates a common and unique session key k₀ in accordance with k₀=SK(k_(IV),r_(P),r_(T)). Thus, SK means a concatenation of k_(IV) and at least one part (r_(P),r_(T)) of a random number r in the form of a session key calculating function. In accordance with one embodiment, the session key may be calculated as follows: SK: k _(P):=NLM(EXT(k _(IV)),r _(P)),  (17) k′:=AES(key=PAD(k _(P)),k _(IV)),  (18) k ₀:=AES(key=PAD(r _(T)),k′).  (19)

This means that in a first sub-step (equation 17) a non-linear map or concatenation of 32 bits of the secret information k_(IV) and the 32-bit random value r_(P) may be formed in accordance with k_(p):=NLM(EXT(k_(IV)),r_(P)), wherein: NLM:GF(2)³² ×GF(2)³² →GF(2)³² ,z=NLM(x,y)  (20) applies, which means that in accordance with embodiments, the means 24 for calculating the session key k₀ is adapted to calculate the session key using a non-linear concatenation NLM of at least one part r_(P) of the random number and the part EXT (k_(IV)) of the secret information k_(IV). One object of the non-linear concatenation NLM is concatenating the chip-individual secret k_(IV) and the publicly accessible random number r_(P) such that no information regarding k_(IV) can be obtained by means of a side channel or DPA attack. In accordance with embodiments, the 128-bit secret k_(IV) and the 32-bit random variable r_(P) are combined to form a random 32-bit session key precursor value k_(P). The final session key k₀ may then be determined based on the precursor value k_(P). Formally, the non-linear concatenation may be defined in accordance with equation (20). Since k_(P) in accordance with embodiments is the only random basis for the session key k₀, in accordance with the example described here, a maximum of 2³² different session keys can be generated. Thus, it is sufficient to use only 32 bits of k_(IV) as an input to the non-linear concatenation NLM. Of course, any other number of bits may be used, such as, for example, 16, 64, 128, etc.

A non-linear feedback shift register (NLFSR) may be used as a highly efficient implementation of the non-linear concatenation NLM. It is characteristic of a non-linear feedback shift register that it retains a zero state, i.e. a state in which all register cells are initialized using zeros. With exemplarily 32 register cells, every initial state different to zero will repeat after exactly 2³²−1 clock cycles. In other words, a state of the shift register, if operated autonomously, repeats itself with a period of 2³²−1.

A schematic illustration of a potential implementation of a non-linear feedback shift register in accordance with an embodiment of the present invention is shown in FIG. 15A.

The entire contents of 32 register cells D₀ to D₃₁ are fed to the function f. After each clock, contents of a register cell can be passed on to a neighboring register cell, as is indicated by the arrows shown in FIG. 15A. This means that the contents of the register cell D1 are passed on to the register cell D0, the contents of the register cell D2 are passed on to the register cell D1, etc. The result of the function f is written to the register cell D₃₁ after same has passed on its previous value to the cell D₃₀.

One potential calculation of the non-linear concatenation NLM using the NLFSR, in accordance with one embodiment, implies the following steps:

-   -   1. Setting the initial state of the NLFSR:         -   Loading r_(P)[0 . . . 31] in the register cells D[0 . . .             31].     -   2. Inserting the part of the secret information:         -   The part of the secret information k_(IV)[0 . . . 31] is             sequentially coupled into the NLFSR in accordance with the             following order k_(IV)[0], k_(IV)[1], k_(IV)[2], . . . ,             k_(IV)[31], as is illustrated in FIG. 15B. Thus, the NLFSR             is clocked after each coupling-in step. This means that             inserting the part k_(IV)[0 . . . 31] takes T_(SIK)=32 clock             cylces.     -   3. Concatenation:         -   The NLFSR is clocked autonomously for a time T_(MIX)=64             cycles. This means that during this time T_(MIX), there is             nothing to be inserted or coupled into the register. After             64 clock cycles, the register contents T[0 . . . 31] form             the session key precursor value k_(P).

In accordance with another embodiment of the present invention, the non-linear concatenation NLM may, instead of using a non-linear feedback shift register, also be realized based on an irreproducible polynomial f(X), i.e. a polynomial which cannot be written as a product of two non-trivial polynomials.

With x=(x₀,x₁, . . . , x₃₁), y=(y₀,y₁, . . . , y₃₁), z=(z₀,z₁, . . . , z₃₁), z=NLM(x,y) may exemplarily be determined in accordance with z ₃₁ X ³¹ + . . . +z ₁ X ¹ +z ₀=(x ₃₁ X ³¹ + . . . +x ₁ X ¹ +x ₀)*(y ₃₁ X ³¹ + . . . +y ₁ X ¹ +y ₀) mod f(X)  (21)

or, expressed in short, z=x*y mod f. Since this is a multiplication within a finite body GF(2³²), NLM(x,NLM(y₁,y₂))=NLM(NLM(x,y₁),y₂) applies here. For this reason, an implementation of equation (17) in accordance with: r _(P):=NLM(r ₁ ,r ₂),  (22) k′ _(P)NLM(EXT(k _(IV))·r ₁),  (23) k _(P):=NLM(k′ _(P) ,r ₂)  (24) can be protected against DPA attacks if EXT(k_(IV))≠(0, 0, . . . , 0). In accordance with this embodiment, the non-linear concatenation in accordance with equation (17) is split up into two non-linear concatenations in accordance with equations (23) and (24). Thus, in an alternative embodiment of step P1, the random number generator RNG generates three random values r₁, r₂ and R_(P). R_(P) may in accordance with embodiments have a width of 128 bits and is sent to the second communication partner T as a so-called “challenge”. r₁ and r₂ may each have a width of 32 bits and are used for calculating the session key k₀. R_(P) and r₁, r₂ are assumed to be binary numbers having independently and uniformly distributed random bits. The first communication partner P calculates r_(P):=NLM(r₁, r₂) and stores r₁ and r₂ in a temporary storage.

One realization of NLM including the irreproducible polynomial f (X) in accordance with one embodiment mainly uses a linear feedback shift register (LFSR) which is defined by the polynomial f(X) together with a second register which contains the first argument x of the function z=NLM(x,y). Thus, the second register is coupled to the LFSR by logical AND and XOR gates. The value z may exemplarily be calculated as follows:

-   -   1. Setting all register cells of the LFSR to zero     -   2. Loading register cells X_(i) of the second register with the         value x_(i) (i=0, . . . , 31)     -   3. Coupling the values y₃₁, y₃₀, . . . , y₀ into the AND gates         for a time T=32 clock cycles so as to concatenate y and x     -   4. After 32 clock cycles, the register contents of the LFSR form         the value z=(z₀,z₁, . . . , z₃₁).

This means that the means 24 for calculating the session key k₀ in accordance with one embodiment is adapted to implement the non-linear concatenation NLM using a linear feedback shift register which is defined by an irreproducible polynomial f(X) so that a result of the non-linear concatenation (NLM) is dependent on a modulo operation of a multiplicative concatenation of the at least one part of the random number and the part of the secret information k_(IV) including the irreproducible polynomial f(X) (cf. equation 23 in connection with equation 21).

A significant reduction of side-channel leaks can be achieved during generating the session key k₀ by means of an adequate implementation of the non-linear concatenation NLM—to the extent that DPA attacks will be almost impossible, even for experienced attackers. Furthermore, calculating the session key k₀ may be accelerated by the non-linear concatenation NLM.

In a step following the non-linear concatenation NLM, secret information k_(IV) is concatenated with the session key precursor value k_(P) in accordance with equation (18). Thus, the concatenation AES (.,.) is an encryption algorithm. In accordance with embodiments, the encryption algorithm AES is a block encryption or block cipher. In particular, block encryption in accordance with the so-called Advanced Encryption Standard (AES) may be used. This means that, in accordance with embodiments, means 24 for calculating the session key k₀ is adapted to use a value k_(P) derived from the non-linear concatenation NLM as a key for an encryption AES so as to encrypt the secret information k_(IV) or a value derived therefrom and obtain the session key k₀ based on that encryption.

In accordance with embodiments, it is also possible for only the first communication partner P to determine a random number r_(P), but not the second communication partner T. In this case, the value k′ resulting from the encryption in accordance with equation (18) would already be the session key.

In the embodiment discussed here, the encryption in accordance with equation (18), however, can be improved by the second random number r_(T) by concatenating, in a third step (equation 19), the intermediate result k′ and the second random value r_(T) in accordance with: k ₀:=AES(key=PAD(r _(T)),k′)  (22) so as to finally obtain the common session key k₀. When uniting equations (17)-(19), the means 24 for calculating the session key k₀ in accordance with embodiments is adapted to calculate the session key k₀ based on: k ₀=AES(PAD)r _(T)),(AES(PAD(NLM(EXT(k _(IV)),r _(P))),k _(IV)))  (23) r_(P) being a first random number, r_(T) being a second random number and k_(IV) indicating the secret information, wherein NLM (‘,’) corresponds to the non-linear concatenation, EXT (′) to an extraction rule, PAD (′) to a bit padding rule and AES (‘,’) to a block encryption in accordance with the Advanced Encryption Standard.

Furthermore, it is conceivable for the steps in accordance with equations (18) and (19) to be substituted by a single encryption step, exemplarily in accordance with: k ₀:=AES(key=PAD2(k _(P)),XOR PAD(r _(T)),k _(IV))  (24) wherein the following function: PAD2:GF(2)³² →GF(2)¹²⁸  (25) means padding a 64-bit value resulting from doubling the 32 bits of the input value y. In particular, the 64-bit value can be padded using zeros.

This means that, in accordance with one embodiment, means 22 for obtaining the random number is adapted to determine a first random number r_(P) in a random or pseudo-random manner and to obtain a second random number r_(T) from the other communication partner. The means 24 for calculating the session key k₀ is adapted to calculate the session key k₀ based on an encryption AES of a value derived from the secret information k_(IV) with a key derived from the first and second random numbers r_(P) and r_(T). In accordance with another embodiment, the means 22 for obtaining the random number is adapted to determine a first random number k_(P) based on a non-linear concatenation NLM of a random number r_(P) determined in a random or pseudo-random manner, or a value derived therefrom, and a part EXT(k_(IV)) of the secret information k_(IV), and to obtain a second random number r_(T) from the other communication partner. The means 24 for calculating the session key k₀ is adapted to calculate the session key k₀ based on an encryption AES of a value derived from the secret information k_(IV) with a key derived from the first and second random numbers k_(P) and r_(T) (cf. equation 24).

T7: Response Calculation on the Part of the Second Communication Partner T

In step T7, the second communication partner T calculates a “response” c_(P) to the “challenge” R_(P) of the first communication partner P, the session key of step T6 being used here: c _(P):=AES(key=k ₀ ,R _(P))  (26)

T8: Second Message from the Second Communication Partner T to the First Communication Partner P

In step T8, the response c_(P) calculated in step T7, the random value r_(T) determined on the part of the second communication partner T and the random challenge R_(T) are concatenated to form a second message M₂ on the part of the second communication partner T. This message M₂ is transferred from the second communication partner T to the first communication partner P: M ₂ :=c _(P) ∥r _(T) ∥R _(T).  (27)

This means that the second communication partner T, in accordance with one embodiment, at first determines a response to the challenge R_(P) of the first communication partner P (equation 26) based on a concatenation AES of k₀ and R_(P) using a cryptographic algorithm and then transmits same, together with the second random number r_(T) and the random challenge R_(T), to the first communication partner P.

P9: Calculating the Session Key k₀ on the Part of the First Communication Partner P:

After the first communication partner P has received the second message M₂ including the second random number r_(T), the common session key can also be calculated on the part of the first communication partner P in accordance with k₀=SK (k_(IV),r_(P),r_(T)) by the first communication partner P performing the same three steps like the steps of the second communication partner T already described in connection with equations (17)-(19): k _(P)=NLM(EXT(k _(IV)),r _(P)),  (28) k′=AES(key=PAD(k _(P)),k _(IV)),  (29) k ₀=AES(key=PAD(r _(T)),k′).  (30)

The first two steps, i.e. calculating k_(P) and k′, may be executed already before receiving the second message M₂. It is to be mentioned here again that the third step, i.e. calculating k₀ in accordance with equation (30), only has to be performed when exemplarily the second random number r_(T) is determined on the part of the second communication partner T. As mentioned before, embodiments of the present invention also include those cases in which a random number is determined in a random manner only on the part of the first communication partner P or by a trusted third party and provided to the communication partners P, T. The step in accordance with equation (30) thus serves for additionally increasing the security of key calculation. In accordance with the embodiment described here, the means 22 for obtaining the random number on the part of P is also adapted to determine a first random number r_(P) in a random or pseudo-random manner and to obtain a second random number r_(T) before the second communication partner T. The means 24 for calculating the session key k₀ is adapted to obtain the session key k₀ based on a second encryption (equation 30) of a value k′ derived from a first encryption (equation 29) with a value derived from the second random number r_(T), wherein a value k_(P) derived from a non-linear concatenation (equation 28) of the first random number r_(P) and the part of the secret information k_(IV) is used as the key for the first encryption in order to encrypt the secret information or a value derived therefrom and to obtain the session key k₀ based on the first and second encryptions.

As already described before, it is also possible for the steps in accordance with equations (18) and (19) or equations (29) and (30) to be substituted by a single encryption step, for example in accordance with: k ₀:=AES(key=PAD2(k _(P)),XOR PAD(r _(T)),k _(IV)).  (31)

In the case of NLM being based on the irreproducible polynomial f(X), calculating the session key k₀ on the part of the first communication partner P in accordance with one embodiment may also be done in accordance with: k′P:=NLM(EXT(kIV),r1),  (32) kP:=NLM(k′P,r2)  (33) k ₀:=AES(key=PAD2(k _(P))XOR PAD(r _(T)),k _(IV)).  (34)

P10: Response Calculation on the Part of the First Communication Partner P:

In step P10, the first communication partner P in accordance with one embodiment calculates a response C_(T) to the challenge R_(T) of the second communication partner T based on the common session key k₀ which was calculated in step P9: c _(T):=AES(key=k ₀ ,R _(T)).  (35)

This means that the session key k₀ is used as a key for block encryption in accordance with the AES standard to encrypt the challenge R_(T) of the second communication partner T and thus obtain the response c_(P).

P11: Third Message (from the First Communication Partner P to the Second Communication Partner T):

In step P11, the first communication partner P sends the response c_(T) calculated in step P10 to the second communication partner T.

P12: Response Verification on the Part of the First Communication Partner P:

Here, the random challenge R_(P) having been sent to the second communication partner T by means of the first message M₁ is encrypted on the part of the first communication partner P using the session key k₀ in accordance with: c _(P)′=AES(key=k ₀ ,R _(P))  (36)

in order to obtain a response comparative value c_(P)′. Then, the response comparative value c_(P)′ obtained is compared on the part of the first communication partner P to the response c_(P) having been obtained by the second message M₂ from the second communication partner T. If c_(P)′=C_(P), the second communication partner T can be authenticated successfully on the part of the first communication partner P. Otherwise, authentication will fail. When authentication fails, further communication between the two communication partners P, T is to be stopped. Failing authentication may be signaled to the second communication partner T.

T13: Response Verification on the Part of the Second Communication Partner T:

Here, the random challenge R_(T) having been sent to the second communication partner P using the second message M₂ is encrypted on the part of the second communication partner T using the session key k₀ in accordance with: c _(T)′=AES(key=k ₀ ,R _(T))  (37)

in order to obtain a response comparative value c_(T)′. Then, the response comparative value c_(T)′ obtained is compared to the response c_(T) having been obtained by the second communication partner T by the third message M₃ (step P11) on the part of the second communication partner T. If c_(T)′=c_(T), the first communication partner P may be authenticated successfully on the part of the second communication partner T. Otherwise, authentication will fail. When authentication fails, further communication between the two communication partners P, T is to be stopped. Failing authentication may be signaled to the first communication partner P.

A detailed graphical illustration of the embodiments just discussed for authentication methods, in connection with hardware/software blocks involved here, on the part of both communication partners P, T is shown in FIGS. 5 a and 5 b.

After successful authentication 10 and successful generation of the session key k₀, the method may proceed with the data transfer step 12 between the two communication partners P and T. Here, the first communication partner P may make parts of its memory accessible for the second communication partner T (maybe also vice versa) so that the second communication partner T is able to read certain data blocks for which he is in possession of corresponding access rights. Equally, T is able to write certain data blocks. Thus, reading and/or programming from and to a non-volatile memory of the first communication partner P is done by P itself. However, the first communication partner P receives the commands for this from the second communication partner T.

Communication and/or data transfer between the two communication partners P and T may be organized in data frames F₁, F₂, F₃, . . . which may be transmitted both from P to T and vice versa. For reasons of security, a secret key k_(i) is needed as an input from each data frame F_(i). After having processed a data frame F_(i), a new key k_(i+1) which may be used for subsequent data frame F_(i+1) to be transmitted can be generated. A first secret key k₁ for the first data frame F₁ to be transmitted is derived from the session key k₀.

All the data frames contain security-relevant data packages D₁, D₂, D₃, . . . which may be exchanged between the two communication partners P and T. Thus, it is irrelevant which direction the data packages are sent in. They may be indexed by their global occurrence, as is schematically and exemplarily illustrated in FIG. 6.

In accordance with one embodiment of the present invention, each data package D_(x) contains a maximum of 128 bits, wherein other data package sizes are of course also conceivable. The data packages sent from the first communication partner P to the second communication partner T may contain data read out from the memory of P. Data packages in the other direction, i.e. from T to P, may contain data to be written to the memory of P. Additionally, the data packages exchanged may contain read/write commands and/or memory addresses of the data. A higher protocol layer (wrapping protocol layer) in accordance with embodiments defines which of the control data can be sent outside the data packages D_(x) subject to the protection mechanisms described here.

The data packages may be arranged in data frames which contain consecutive data packages. All the data packages of one data frame are sent in the same direction, i.e. either from T to P or vice versa, namely from P to T, and have a special order. Organization here is done by the higher protocol layer.

In the privacy protection mode, the data packages transmitted during the data transfer 12 may be encrypted, for example by means of an AES algorithm. Each package here may exemplarily have a size of 128 bits. On the other hand, the integrity protection mode may also be used during data transfer 12 by calculating message authentication codes (MACs). In this case, the size of the data packages may be smaller than or equaling 128 bits. Every data frame may in this case include an MAC package M_(i) which is not part of the data packages D₁, D₂, D₃, . . . .

As is schematically indicated in FIG. 6, a first step 61 of the data transfer phase is deriving the first secret key k₁ for the first data frame F₁ to be transmitted based on the session key k₀. Step 61 is identical for both the integrity protection and privacy protection modes. Input parameters for step 61 may, as is illustrated in FIG. 7, be the session key k₀, and the two random challenges R_(P) and R_(T) having been generated during the authentication phase 10 by both the first communication partner P and the second communication partner T. In accordance with one embodiment, the first key k₁ may be calculated in accordance with: k ₁:=AES(key=R _(P) ;k ₀ XOR R _(T))  (38)

as is illustrated graphically in FIG. 7 a. This means that the challenge value R_(P) may be used as a key for an AES encryption in order to encrypt an XOR concatenation of the challenge value R_(T) and the session key k₀ and obtain the first derived key k₁ based on the AES encryption.

In accordance with another embodiment, the first key k₁ may also be calculated in accordance with: k ₁:=AES(key=R _(P) ;k ₀ XOR R _(T))XOR(k ₀ XOR R _(T))  (39) as is illustrated graphically in FIG. 7 b.

In the integrity protection mode, every data frame F_(i) can be provided with a check part (MAC) M_(i) for authenticating the data frame, wherein the check part M_(i) is generated by means of a corresponding key k_(i). The check part M_(i) may exemplarily be a CBC-MAC (cipher block chaining message authentication code), an HMAC (keyed-Hash message authentication code), OMAC (one-key MAC), UMAC (message authentication code based on universal hashing), PMAC (parallelizable MAC) or CMAC (cipher-based MAC).

The sequence of data packages D_(x),D_(x+1), . . . , D_(y) of a data frame F_(i) is finalized by the check part M_(i) as is schematically shown in FIG. 8. The transmitter of the frame F_(i) uses k_(i) and the data packages D_(x),D_(x+1), . . . , D_(y) to determine the check part M_(i) and transmits (D_(x), . . . , D_(y),M_(i)) within the frame F_(i). This means that the means 28 for using the session key k₀ in accordance with embodiments is adapted to calculate, for communicating to the second communication partner, a check part M_(i) for authenticating a message M_(i) based on the message and the session key k₀ or a key k_(i) derived therefrom.

In the same manner, the receiver of the data frame M_(i) including the contents (D_(x), . . . , D_(y),M_(i)) may be formed so as to use k_(i) and the data packages D_(x),D_(x+1), . . . , D_(y) received for calculating a check part resulting therefrom. The receiver compares the resulting check part to the value M_(i) received. If the values are identical, data transfer between the two communication partners can be continued, otherwise data transfer is to be stopped. The receiver may notify the transmitter about an MAC error.

Both communication partners P and T also compute the key k_(i+1) for a data frame F_(i+1) to be transmitted next (see FIG. 6, steps 62, 63, 64). In accordance with one embodiment of the present invention, the check part M_(i) and the subsequent key k_(i+1) may be calculated as follows:

$\begin{matrix} {{{h_{x}:=k_{i}},{h_{x + 1}:={{{AES}\left( {{{key} = h_{x}};D_{x}} \right)}{XOR}\; D_{x}}},{h_{x + 2}:={{{AES}\left( {{{key} = h_{x + 1}};D_{x + 1}} \right)}{XOR}\; D_{x + 1}}},{h_{x + 3}:={{{AES}\left( {{{key} = h_{x + 2}};D_{x + 2}} \right)}{XOR}\; D_{x + 2}}},\ldots}{{h_{y + 1}:={{{AES}\left( {{{key} = h_{y}};D_{y}} \right)}{XOR}\; D_{y}}},{k_{i + 1}:=h_{y + 1}},{M_{i}^{\prime}:={{{AES}\left( {{{key} = k_{i}};k_{i + 1}} \right)}{XOR}\; k_{i + 1}}},{M_{i}:={{EXT}\left( M_{i}^{\prime} \right)}}}} & (40) \end{matrix}$

If the size of a data package D_(x) is less than 128 bits, the respective data package D_(x) can be padded with zeros so as to obtain a size of 128 bits. The padded data package D_(x) may then be used as an input for the AES block encryption and/or the XOR operations.

Generation of the check value M_(i) and the subsequent key k_(i+1) is again illustrated graphically in FIG. 9.

It becomes clear from FIG. 9 that the subsequent key k_(i+1) is determined from the predecessor key k_(i) and the individual data packages D_(x),D_(x+1), . . . , D_(y) of the data frame F_(i). Thus, a first data package D_(x) is block-encrypted using the predecessor key k_(i), the result of this block encryption is XOR-operated again using the first data package D_(x), wherein the result of the concatenation in turn is used as a key for block-encrypting the second data package D_(x+1) in order to concatenate the result of this block encryption in turn with the second data package D_(x+1) and use the result of this concatenation in turn as a key for the subsequent data package D_(x+2), etc.

The check part M_(i) is formed by using the predecessor key k_(i) as a key for encrypting the subsequent key k_(i+1) in accordance with AES block encryption. The result of this encryption may then be XOR-concatenated with k_(i+1) so as to obtain the MAC check value M_(i). This means that, in accordance with one embodiment of the present invention, the means 28 for using the session key is adapted to calculate a check part M_(i) of a current message F_(i) to be transferred based on a current key k_(i) derived from the session key k₀ and a subsequent key k_(i+1) for a message F_(i+1) to be transferred subsequently, the subsequent key k_(i+1) being dependent on the derived current key k_(i) and the current message F_(i) to be transferred.

FIG. 10 shows an entire flow of the integrity protection mode for two data frames to be transmitted, starting at generating the first key k₁ based on the session key k₀.

In the privacy protection mode, every data frame F_(i) is secured by encrypting the data blocks D_(x) to form encrypted blocks C_(i), the key k_(i) being used here. This procedure is schematically shown in FIG. 11.

The transmitter of the data frame F_(i) uses k_(i) and the data packages D_(x),D_(x+1), . . . D_(y), encrypts every data package D_(j) to form an encrypted package C_(j) and transmits (C_(x), . . . , C_(y)) within the data frame F_(i). The receiver of the data frame containing (C_(x), . . . , C_(y)) also uses the key k_(i) and the encrypted C_(x), . . . , C_(y) in order to recover the unencrypted packages D_(x),D_(x+1), . . . . D_(y). Both communication partners calculate the subsequent key k_(i+1) for the subsequent data frame F_(i+1). There are different procedures for processing longer messages. The data may at first be separated into data packages D_(x), the size of which is predetermined by the encryption algorithm (such as, e.g., 128 bits). The electronic code book mode (ECB) and cipher block chaining mode (CBC) modes of operation necessitate entire data packages. Thus, the last data package D_(y) may be padded with fill data. The data packages may subsequently be encrypted one after the other. In a frequently employed CBC method, the result of encrypting a data package, the cipher of the data package encrypted before is concatenated or chained with the following data package. The calculations of the transmitter for obtaining C_(j) and k_(i+1) in accordance with one embodiment are as follows:

$\begin{matrix} {{{h_{x}:=k_{i}},{h_{x}:={{{AES}\left( {{{key} = h_{x - 1}};q} \right)}{XOR}\; q}},{C_{x}:={{AES}\left( {{{key} = h_{x}};D_{x}} \right)}},{h_{x + 1}:={{{AES}\left( {{{key} = h_{x}};q} \right)}{XOR}\; q}},{C_{x + 1}:={{AES}\left( {{{key} = h_{x + 1}};D_{x + 1}} \right)}},\ldots}{{h_{y}:={{{AES}\left( {{{key} = h_{y - 1}};q} \right)}{XOR}\; q}},{C_{y}:={{AES}\left( {{{key} = h_{y}};D_{y}} \right)}},{k_{i + 1}:=h_{y}}}} & (41) \end{matrix}$

The value q thus exemplarily represents a 128-bit value which may be defined as desired, but then remains constant. In accordance with embodiments, the size of a data package D_(x) may be 128 bits. Padding with zeros in order to reach this size may be performed by a higher wrapping protocol layer. The structure of key generation in the privacy protection mode, which is graphically illustrated in FIG. 12, is, in accordance with embodiments, identical to key generation in the integrity protection or MAC mode. A comparison of FIGS. 9 and 12 reveals that, compared to the MAC mode, in the privacy protection mode D_(x+j) is only substituted by the constant q. This procedure offers the advantage that a reduction in hardware resources, for example in the form of additional control and data paths, can be avoided.

In the same way as FIG. 10 for the MAC mode, FIG. 13 shows an entire data flow for two data frames to be transmitted for the privacy protection mode, wherein generating the first key k₁ based on the session key k₀ is started with.

In analogy to FIG. 12, FIG. 14 shows a scheme for decrypting the encrypted packages C_(x), . . . , C_(y) of the data frame F_(i) on the part of a receiver of the data frame. The key calculation of keys k_(i) and k_(i+1), and all the intermediate keys h_(x−1), h_(x), h_(x+1), . . . , located in between takes place in an identical manner to that on the part of the transmitter, i.e. in accordance with equation (41). For decrypting the encrypted packages C_(x), the intermediate keys h_(x) determined are used as a key for block decryption AES⁻¹ which is inverse to block encryption AES:

$\begin{matrix} {{{h_{x}:=k_{i}},{h_{x}:={{{AES}\left( {{{key} = h_{x - 1}};q} \right)}{XOR}\; q}},{D_{x}:={{AES}^{- 1}\left( {{{key} = h_{x}};C_{x}} \right)}},{h_{x + 1}:={{{AES}\left( {{{key} = h_{x}};q} \right)}{XOR}\; q}},{D_{x + 1}:={{AES}^{- 1}\left( {{{key} = h_{x + 1}};C_{x + 1}} \right)}},\ldots}{{h_{y}:={{{AES}\left( {{{key} = h_{y - 1}};q} \right)}{XOR}\; q}},{D_{y}:={{AES}^{- 1}\left( {{{key} = h_{y}};C_{y}} \right)}},{k_{i + 1}:=h_{y}}}} & (42) \end{matrix}$

Since both communication partners P and T generally act as both transmitter and receiver, in accordance with embodiments, the means 28 for using the session key is adapted to encrypt/decrypt a current key k_(i+1) for a current data block D_(i+1)/C_(i+1) to be encrypted/decrypted, based on a previous key k_(i) for a data block D_(i)/C_(i) to be encrypted/decrypted before and a predetermined value q.

In summary, embodiments of the present invention are firstly aimed at secure mutual authentication of two communication partners P and T. Thus, in accordance with embodiments, a first communication partner may be a so-called proximity card P and the second communication partner a corresponding reader T. Secondly, embodiments of the present invention are aimed at ensuring integrity protection of messages exchanged between the two communication partners. Thirdly, in accordance with embodiments, protection of privacy of the messages exchanged is to be ensured. Thus, in accordance with embodiments, the two last goals are mutually exclusive, i.e. the communication partners may, after secure mutual authentication 10, consent to either a data transfer mode 12 including integrity protection or a data transfer mode including privacy protection. As a basic prerequisite, both communication partners T and P share common secret information k_(IV), in accordance with the settings of private-key cryptography. In accordance with embodiments, the AES including a key length of 128 bits may be used for block encryption. However, other block encryption algorithms and other key lengths are also conceivable.

Embodiments of the present invention are able to inherently increase security against side-channel attacks. This allows reducing hardware-specific measures in an underlying encryption module, in particular an AES hardware module. This may exemplarily result in proximity cards of considerably reduced sizes.

In one embodiment, in the device for generating a session key, encryption is block encryption. Block encryption may be based on the Advanced Encryption Standard (AES).

In one embodiment, in the device for generating a session key, the secret information k_(IV) may be determined by means of a key derivation function (KD) based on an apparatus-specific identification and a general key k_(M).

Depending on the circumstances, the inventive methods may be implemented in either hardware or software. The implementation may be on a digital storage medium, for example on a DVD, CD or disc having control signals which can be read out electronically, which can operate with a programmable computer system such that the respective method will be executed. Generally, the invention thus also includes a computer program product comprising a program code, stored on a machine-readable carrier, for performing the respective inventive method when the computer program product runs on a computer. In other words, the invention may also be realized as a computer program for performing a method for generating a session key when the computer program runs on a computer.

While this invention has been described in terms of several embodiments, there are alterations, permutations, and equivalents which fall within the scope of this invention. It should also be noted that there are many alternative ways of implementing the methods and compositions of the present invention. It is therefore intended that the following appended claims be interpreted as including all such alterations, permutations, and equivalents as fall within the true spirit and scope of the present invention. 

What is claimed is:
 1. A key-generating apparatus for generating a session key that is known to a first communication apparatus and a second communication apparatus, for the first communication apparatus, from secret information that may be determined by the first and second communication apparatuses, the key-generating apparatus comprising: a first digital circuit adapted to calculate the session key using a non-linear concatenation of at least a part of a random number and a part of the secret information; and a second digital circuit adapted to use the session key for communication with the second communication apparatus; wherein the first digital circuit is adapted to implement the non-linear concatenation using (i) a non-linear feedback shift register that is loaded by the at least one part of the random number and sequentially concatenates individual bits of the part of the secret information to register cells of the shift register, or (ii) a non-linear feedback shift register that is loaded by the part of the secret information and sequentially concatenates individual bits of the at least one part of the random number to register cells of the shift register, or (iii) a linear feedback shift register that is defined by an irreproducible polynomial so that a result of the non-linear concatenation is dependent on a modulo operation of a multiplicative concatenation of the at least one part of the random number and the part of the secret information comprising the irreproducible polynomial.
 2. The key-generating apparatus in accordance with claim 1, comprising a third digital circuit adapted to determine at least a first part of the random number in a random or pseudo-random manner.
 3. The key-generating apparatus in accordance with claim 2, wherein the third digital circuit is adapted to acquire a second part of the random number from the second communication apparatus.
 4. The key-generating apparatus in accordance with claim 2, wherein the third digital circuit is adapted to determine a first random number in a random or pseudo-random manner and acquire a second random number from the second communication apparatus, and wherein the first digital circuit is adapted to acquire the session key based on a second encryption of a value derived from a first encryption with a value derived from the second random number, wherein a value derived from a non-linear concatenation of the first random number and the part of the secret information is used as a key for the first encryption to encrypt the secret information or a value derived therefrom and acquire the session key based on the first and second encryptions.
 5. The key-generating apparatus in accordance with claim 2, wherein the third digital circuit is adapted to determine a first random number in a random or pseudo-random manner and acquire a second random number from the second communication apparatus, and wherein the first digital circuit is adapted to calculate the session key based on an encryption of a value derived from the secret information with a key derived from the first and second random numbers.
 6. The key-generating apparatus in accordance with claim 1, wherein the first digital circuit is adapted to use a value derived from the non-linear concatenation as a key for encryption in order to encrypt the secret information or a value derived therefrom and acquire the session key based on the encryption.
 7. The key-generating apparatus in accordance with claim 1, wherein the first digital circuit is adapted to use the secret information or a value derived therefrom as a key for encryption to encrypt a value derived from the non-linear concatenation and acquire the session key based on the encryption.
 8. The key-generating apparatus in accordance with claim 1, wherein the second digital circuit is adapted to calculate, for communication with the second communication apparatus, a check part for authenticating a message based on the message and the session key or a key derived therefrom.
 9. The key-generating apparatus in accordance with claim 8, wherein the second digital circuit is adapted to calculate a check part of a current message to be transferred based on a current key derived from the session key and a subsequent key for a subsequent message to be transferred, the subsequent key being dependent on the current key derived and the current message to be transferred.
 10. The key-generating apparatus in accordance with claim 8, wherein the second digital circuit is adapted to use block encryption in accordance with the Advanced Encryption Standard for calculating the check part.
 11. The key-generating apparatus in accordance with claim 1, wherein the second digital circuit is adapted to encrypt/decrypt, for communication with the second communication apparatus, data blocks of a message based on the session key or a key derived therefrom.
 12. The key-generating apparatus in accordance with claim 11, wherein the second digital circuit is adapted to encrypt/decrypt a current key for a current data block to be encrypted/decrypted based on a previous key for a previous data block to be encrypted/decrypted and a predetermined value.
 13. The key-generating apparatus in accordance with claim 12, wherein the second digital circuit is adapted to use block encryption in accordance with the Advanced Encryption Standard for calculating the current key.
 14. A method for generating a session key that is known to a first communication apparatus and a second communication apparatus, for the first communication apparatus, from secret information that may be determined by the first and second communication apparatuses, the method comprising, in a digital circuit of the first communication apparatus: acquiring a random number; calculating, with the digital circuit, the session key using a non-linear concatenation of at least a part of the random number and a part of the secret information; and using the session key for communication with the second communication apparatus; wherein the non-linear concatenation is implemented by the digital circuit using (i) a non-linear feedback shift register that is loaded by the at least one part of the random number and sequentially concatenates individual bits of the part of the secret information to register cells of the shift register, or (ii) a non-linear feedback shift register that is loaded by the part of the secret information and sequentially concatenates individual bits of the at least one part of the random number to register cells of the shift register, or (iii) a linear feedback shift register that is defined by an irreproducible polynomial so that a result of the non-linear concatenation is dependent on a modulo operation of a multiplicative concatenation of the at least one part of the random number and the part of the secret information comprising the irreproducible polynomial.
 15. The method in accordance with claim 14, wherein the session key is generated by both the first and second communication apparatus based on the random number and the secret information.
 16. The method in accordance with claim 14, wherein, when acquiring the random number, a first random number is determined based on a non-linear concatenation of a random number determined in a random or pseudo-random manner or a value derived therefrom and a part of the secret information, and a second random number is acquired from the second communication apparatus, and wherein calculating the session key is based on block encryption of a value derived from the secret information with a key derived from the first and second random numbers.
 17. The method in accordance with claim 14, wherein, when acquiring the random number, a first random number is determined by the first communication apparatus in a random or pseudo-random manner, and a second random number is acquired from the second communication apparatus, and wherein calculating the session key is based on block encryption of the second random number with block encryption of the secret information with a non-linear concatenation of the first random number and the part of the secret information.
 18. The method in accordance with claim 14, wherein the session key is used in an authentication method as a common secret for authentication between the first and second communication apparatuses.
 19. The method in accordance with claim 18, wherein the authentication method is a challenge-response method for a single-sided or mutual authentication using the session key.
 20. A computer program product comprising program code stored on a non-transitory machine-readable carrier for performing a method of generating a session key that is known to a first communication apparatus and a second communication apparatus, for the first communication apparatus, from secret information that may be determined by the first and second communication apparatuses, the program code comprising instructions for: acquiring a random number; calculating the session key using a non-linear concatenation of at least a part of the random number and a part of the secret information; and using the session key for communication with the second communication apparatus when the computer program runs on a computer or microcontroller; such that the non-linear concatenation is implemented using (i) a non-linear feedback shift register that is loaded by the at least one part of the random number and sequentially concatenates individual bits of the part of the secret information to register cells of the shift register, or (ii) a non-linear feedback shift register that is loaded by the part of the secret information and sequentially concatenates individual bits of the at least one part of the random number to register cells of the shift register, or (iii) a linear feedback shift register that is defined by an irreproducible polynomial so that a result of the non-linear concatenation is dependent on a modulo operation of a multiplicative concatenation of the at least one part of the random number and the part of the secret information comprising the irreproducible polynomial. 